Convergence method, properties and computational complexity for Lyapunov games
نویسندگان
چکیده
منابع مشابه
Convergence method, properties and computational complexity for Lyapunov games
We introduce the concept of a Lyapunov game as a subclass of strictly dominated games and potential games. The advantage of this approach is that every ergodic system (repeated game) can be represented by a Lyapunov-like function. A direct acyclic graph is associated with a game. The graph structure represents the dependencies existing between the strategy profiles. By definition, a Lyapunov-li...
متن کاملThe Computational Complexity of Games and Puzzles
The subject of my thesis is studying the algorithmic properties of one and two-player games people enjoy playing, such as chess or Sudoku. This research falls into a wider area known as combinatorial game theory. One of the main questions asked about games in this context is whether they are algorithmically tractable, that is, whether they can be solved with efficient algorithms. So far, more t...
متن کاملThe Computational Complexity of Estimating Convergence Time
An important problem in the implementation of Markov Chain Monte Carlo algorithms is to determine the convergence time, or the number of iterations before the chain is close to stationarity. For many Markov chains used in practice this time is not known. Even in cases where the convergence time is known to be polynomial, the theoretical bounds are often too crude to be practical. Thus, practiti...
متن کاملComputational Complexity of Weighted Threshold Games
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its weights exceeds a given threshold. Key questions in coalitional games include finding coalitions that are stable (in the sense that no member of the coalition has any rational incentive to leave it), and finding a divis...
متن کاملComputational Complexity of Two-Dimensional Platform Games
We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorems: general constructions that allow us to identify a class of these games for which the set of solvable levels is NP-hard, and another class for which the set is even PSPACE-hard. Notably CommanderKeen is shown to be NP-hard, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Mathematics and Computer Science
سال: 2011
ISSN: 1641-876X
DOI: 10.2478/v10006-011-0026-x